Priority and Queuing Specification in 'Distributed Processes'
نویسندگان
چکیده
منابع مشابه
Distributed Queuing or Distributed Priority Queuing? On the Design of Cache-Coherence Protocols for Distributed Transactional Memory
Distributed transactional memory (TM) promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. In distributed TM systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. In this paper, we formalize two classes of cache-coherence protocols: distr...
متن کاملQueuing or Priority Queuing? On the Design of Cache-Coherence Protocols for Distributed Transactional Memory
Distributed transactional memory (TM) promises to alleviate difficulties with lock-based (distributed) synchronization and object performance bottlenecks in distributed systems. In distributed TM systems, both the management and consistency of a distributed transactional object are ensured by a cache-coherence protocol. In this paper, we formalize two classes of cache-coherence protocols: distr...
متن کاملPriority queuing in an operating system
The analysis of a preemptive priority queuing system with K ( ≥ 2 ) classes of jobs is undertaken. The system consists of a single processor representing a model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedules jobs which arrive according to a Markov arrival process. The process of service is arbitrary. With each job ar...
متن کاملDistributed Queuing in Dynamic Networks
We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected. This is a synchronous model in which network nodes are assumed to be fixed, the communication links for each round are chosen by an adversary, and nodes do not know who th...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1982
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/25.1.34